All Questions
13 questions
5votes
4answers
477views
Count number of substrings in less time
Given an input string contains letters from 'a' to 'g' Count how many substrings are there in the input string such that frequency of any character inside the substring is not more than the number of ...
- 373
13votes
5answers
2kviews
solve n*m matrix processing in less time
I want to solve a problem in less time complexity. Here are the details: Given an n*m matrix, n rows and m columns. Initially, the matrix is empty filled with 0s. ...
- 373
2votes
2answers
98views
For two sequences N and M, display counts of elements n from N below each m from M up to the first n above m
A school's task: There are two sequences n_tab and m_tab. For every element m in m_tab ...
- 171
2votes
0answers
120views
Monotonic stack - complexity analysis
I tried following the official solution of LC975 (https://leetcode.com/problems/odd-even-jump/), using a monotonic stack - i.e., I reimplemented their solution (Approach 1) from python in C++. TLDR ...
- 322
9votes
3answers
4kviews
Find the smallest positive integer that is absent from a given array
I made the acquaintance of big-O a couple of weeks ago and am trying to get to grips with it, but although there's a lot of material out there about calculating time complexity, I can't seem to find ...
4votes
2answers
451views
Compare Strings
You have been given two strings, A and B (of length N each) and Q queries. The strings contain only 0s and/or 1s. For every query, you are given an index i. You have to update the value at ...
- 676
8votes
1answer
227views
Compute the height of a tower made of buckets
I need to speed up my algorithm. It is about finding the height of a tower. The tower is built from buckets. Each bucket has height and radius (1 <= height,radius <= 1000). Variable ...
- 83
-2votes
1answer
98views
Leet Code :: Merge Binary Tree :: Time Complexity [closed]
Problem Statement: Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge them into ...
4votes
1answer
104views
Make each element equal to its neighbouring element which is maximum in a matrix
I have a matrix and I want to make each of its element equal to the maximum of its neighbouring element and each time I increase number of counts till all the elements in the matrix becomes equal to ...
- 141
2votes
2answers
107views
High execution time on number partitioning program in Python 2.7
I am writing a program to count only the partitions of a number with distinct parts. I am using a bottom-up approach to dynamic programming to generate partition lists from previously obtained ...
3votes
1answer
431views
Count Acute, Right and Obtuse triangles from n side lengths
Problem Statement: We have \$N\$ sticks. The size of the \$i\$th stick is \$A_i\$. We want to know the number of different types of triangles created with each side from a single different stick. ...
7votes
3answers
916views
Finding the shortest excerpt that contains all search terms
Write a function called answer(document, searchTerms) which returns the shortest snippet of the document, containing all of the given search terms. The search ...
- 623
0votes
2answers
546views
Fastest way to find maximum deviation
I acknowledge that this exact question was asked here. I was working on the same problem from the same website. I had the same question and consulted the above as a reference, however with respect ...
- 229
